The IFF proof procedure for abductive logic programming
نویسندگان
چکیده
منابع مشابه
The CIFF Proof Procedure for Abductive Logic Programming with Constraints
We introduce a new proof procedure for abductive logic programming and present two soundness results. Our procedure extends that of Fung and Kowalski by integrating abductive reasoning with constraint solving and by relaxing the restrictions on allowed inputs for which the procedure can operate correctly. An implementation of our proof procedure is available and has been applied successfully in...
متن کاملThe CIFF Proof Procedure for Abductive Logic Programming with Constraints: Definition, Implementation and a Web Application
Abduction has found broad application as a powerful tool for hypothetical reasoning with incomplete knowledge, which can be handled by labeling some pieces of information as abducibles, i.e. as possible hypotheses that can be assumed to hold, provided that they are consistent with the given knowledge base. Attempts to make the abductive reasoning an effective computational tool gave rise to Abd...
متن کاملThe CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments
We present the CIFF proof procedure for abductive logic programming with constraints, and we prove its correctness. CIFF is an extension of the IFF proof procedure for abductive logic programming, relaxing the original restrictions over variable quantification (allowedness conditions) and incorporating a constraint solver to deal with numerical constraints as in constraint logic programming. Fi...
متن کاملAn Abductive Proof Procedure for Reasoning About Actions in Modal Logic Programming
In this paper we propose a modal approach for reasoning about actions in a logic programming framework. We introduce a modal language which makes use of abductive assumptions to deal with persist-ency, and provides a solution to the ramiication problem, by allowing one-way \causal rules" to be deened among uents. We deene the abductive semantics of the language and a goal directed ab-ductive pr...
متن کاملVerifiable Agent Interaction in Abductive Logic Programming: the SCIFF proof-procedure
SCIFF is a new abductive logic programming proof-procedure for reasoning with expectations in dynamic environments. SCIFF is also the main component of a framework thought to specify and verify interaction in open agent societies. In this paper we present the declarative and operational semantics of SCIFF, its termination, soundness and completeness results, and some sample applications to demo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1997
ISSN: 0743-1066
DOI: 10.1016/s0743-1066(97)00026-5